#include <bits/stdc++.h>
using namespace std;

int a[100001],b[100001];

int main() 
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);

    int i,n,m,k=1,max=0;

    cin>>n;

    for(i=1;i<=n;i++)
    {
        cin>>m;

        a[i]=m;
    }

    sort(a+1,a+n+1);

    b[1]=1;
    
    for(i=2;i<=n;i++)
    {
        if(a[i]==a[i-1])
        {
			b[k]++;
		}
		else
		{
			k++;
			b[k]++;
		}
    }
    
    for(i=1;i<=k;i++)
    {
		if(b[i]>=max)
		{
			max=b[i];
		}
	}
	
	cout<<max<<endl;
    return 0;
}
